if __name__ == '__main__':
    # 递归算法_斐波那契数列
    def fibonacci(n):
        # 基线条件
        if n == 0:
            return 0
        elif n == 1:
            return 1
        # 递归条件
        else:
            return fibonacci(n - 1) + fibonacci(n - 2)
    print(f"递归算法_斐波那契数列: 8 = {fibonacci(8)}")